歐氏定理: 「英文文法跟中文相反」。
以下這一段英文，最重要的是在「最後面」(choose an element of the array and increment it by 1.)
中文意思: 你可以選擇一個(element) ，然後加1。
以程式設計者來說，最重要的部份在於and increment it by 1. 這句英文，
代表你可以每次加1。

所以，閱讀Leetcode 題目時，要跳著看，要從文章的尾端看，才有辨法在20秒內找到重點。
原本的Leetcode 題目如下:
You are given an integer array nums (0-indexed). In one operation, you can choose an element of the array and increment it by 1.

#leetcode #leetcode中文
#Greedy

1827. Minimum Operations to Make the Array Increasing
      「歐氏定理」由歐育溙所發明，專門協助考生通過Leetcode 考試。

You are given an integer array nums (0-indexed). In one operation, you can choose an element of the array and increment it by 1.

For example, if nums = [1,2,3], you can choose to increment nums[1] to make nums = [1,3,3].
Return the minimum number of operations needed to make nums strictly increasing.

An array nums is strictly increasing if nums[i] < nums[i+1] for all 0 <= i < nums.length - 1. An array of length 1 is trivially strictly increasing.

Example 1:

Input: nums = [1,1,1]
Output: 3
Explanation: You can do the following operations:

1. Increment nums[2], so nums becomes [1,1,2].
2. Increment nums[1], so nums becomes [1,2,2].
3. Increment nums[2], so nums becomes [1,2,3].
   Example 2:

Input: nums = [1,5,2,4,1]
Output: 14
Example 3:

Input: nums = [8]
Output: 0

Constraints:

1 <= nums.length <= 5000
1 <= nums[i] <= 104